Layout Generator with Flexible Grid Assignment for Area Efficient Standard Cell
نویسندگان
چکیده
منابع مشابه
Efficient VLSI Layout of Grid Pyramid Networks
Reducing the VLSI layout area of on-chip networks can result in lower costs and better performance. Those layouts that are more compact can result in shorter wires and therefore the signal propagation through the wires will take place in less time. The grid-pyramid network is a generalized pyramid network based on a general 2D Grid structure (such as mesh, torus, hypermesh or WK-recursive mesh)...
متن کاملAn efficient approach for solving layout problems
This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...
متن کاملEfficient channel assignment for cellular networks modeled as honeycomb grid
The channel assignment problem with separation is formulated as a vertex coloring problem of a graph G = (V,E) where each vertex represents a base station and two vertices are connected by an edge if their corresponding base stations are interfering to each other. The L(δ1, δ2, · · · , δt) coloring of G is a mapping f : V → {0, 1, · · · , λ} such that |f(u) − f(v)| ≥ δi if d(u, v) = i, where d(...
متن کاملDocument Recognition System with Layout Structure Generator
A document input system, with character recognition technique, is used for converting printed matter, such as books and magazines, into code-format information. In order to improve this document input system's performance, an appropriate document structure analysis technique is indispen~able(''~'). When storing data from general printed documents into a database, it is necessary to represent th...
متن کاملEfficient Regular Sparse Grid Hierarchization by a Dynamic Memory Layout
We consider a new hierarchization algorithm for sparse grids of high dimension and low level. The algorithm is inspired by the theory of memory efficient algorithms. It is based on a cache-friendly layout of a compact data storage, and the idea of rearranging the data for the different phases of the algorithm. The core steps of the algorithm can be phrased as multiplying the input vector with t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IPSJ Transactions on System LSI Design Methodology
سال: 2015
ISSN: 1882-6687
DOI: 10.2197/ipsjtsldm.8.131